The Graphlet System ( System Demonstration )

نویسنده

  • Michael Himsolt
چکیده

Graphlet is a portable, object oriented toolkit for graph editors and graph drawing algorithms, and is the successor of the GraphEd system. Graphlet is based on LEDA and Tcl/Tk. Algorithms can be implemented in C++ and LedaScript, a new scripting language based on Tcl/Tk. The GML format is a portable le format for graphs. The implementation and visualization of graph algorithms is an important area in research and applications. There is a growing number of systems to support this process. LEDA 8] and GraphBase 7] concentrate on the implementation of a library of graph algorithms. Systems like daVinci 4], DynaDAG 11], D-ABDUCTOR 14] and EDGE 10] concentrate on graph visualization and/or graph editing, while CABRI 3], GD-Workbench 2], GraphEd 6], the Graph Editor Toolkit 9] or VCG 13] combine an editor and a library of algorithms. The scope of these systems ranges from small and on-purpose systems to large, complex ones. However, the user interfaces of many systems are not easy to customize. Therefore, adding new features or exploring new classes of problems remains diicult. Also, implementing new features usually requires a compiler and a development environment. Furthermore, the application programmer interfaces and le formats of most of these systems are mutually incompatible. Graphlet is a portable 1 , object oriented toolkit for implementing graph editors and graph drawing algorithms. Graphlet is the successor of GraphEd 6]. Besides portability and general overhaul, there are several important improvements from GraphEd to Graphlet. Graphlet is based on three external toolk-its, LEDA, Tcl and Tk, which gives us a more powerful design. Graphlet is much more oriented towards rapid prototyping and experiments with algorithms. Graphlet provides a scripting language to make the implementation of tools and customization easier. The GML format provides a powerful and extensible mechanism for writing and exchanging graph les.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Submodular Framework for Graph Comparison

In this paper, we present a submodular framework for graph comparison. Our framework is inspired by latest state-of-the-art submodular document summarization models and extends the graphlet kernel to encourage diversity while avoiding redundancy. Our experiments on several benchmark datasets show that our framework outperforms the graphlet kernel in terms of classification accuracy by using 50%...

متن کامل

A Fast Sampling Method of Exploring Graphlet Degrees of Large Directed and Undirected Graphs

Exploring small connected and induced subgraph patterns (CIS patterns, or graphlets) has recently attracted considerable attention. Despite recent efforts on computing the number of instances a specific graphlet appears in a large graph (i.e., the total number of CISes isomorphic to the graphlet), little attention has been paid to characterizing a node’s graphlet degree, i.e., the number of CIS...

متن کامل

Graphlet correlations for network comparison and modelling : World Trade Network example

We propose methods on two fundamental graph theoretic problems: (1) network comparison, and (2) network modelling. Our methods are applied to five real-world network types, with an emphasis on world trade networks (WTNs), which we choose due to the world’s current economic crisis. Finding topological similarities of complex networks is computationally intractable due to NP-Completeness of the s...

متن کامل

Graphlet Kernels for Prediction of Functional Residues in Protein Structures

We introduce a novel graph-based kernel method for annotating functional residues in protein structures. A structure is first modeled as a protein contact graph, where nodes correspond to residues and edges connect spatially neighboring residues. Each vertex in the graph is then represented as a vector of counts of labeled non-isomorphic subgraphs (graphlets), centered on the vertex of interest...

متن کامل

ergm.graphlets: A Package for ERG Modeling Based on Graphlet Statistics

Exponential-family random graph models (ERGMs) are probabilistic network models that are parametrized by sufficient statistics based on structural (i.e., graph-theoretic) properties. The ergm package for the R statistical computing system is a collection of tools for the analysis of network data within an ERGM framework. Many different network properties can be employed as sufficient statistics...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997